Combinatorial principles equivalent to weak induction
نویسندگان
چکیده
منابع مشابه
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
Goncharov and Peretyat’kin independently gave necessary and sufficient conditions for when a set of types of a complete theory T is the type spectrum of some homogeneous model of T . Their result can be stated as a principle of second order arithmetic, which we call the Homogeneous Model Theorem (HMT), and analyzed from the points of view of computability theory and reverse mathematics. Previou...
متن کاملA Combinatorial Principle]A Combinatorial Principle Equivalent to the Existence
As a consequence of identifying the principle described in the title, we prove that for any uncountable cardinal λ, if there is a λ-free Whitehead group of cardinality λ which is not free, then there are many “nice” Whitehead groups of cardinality λ which are not free.
متن کاملBanach-Alaoglu, boundedness, weak-to-strong principles
• Banach-Alaoglu: compactness of polars • Variant Banach-Steinhaus/uniform boundedness • Second polars • Weak boundedness implies boundedness • Weak-to-strong differentiability The comparison of weak and strong differentiability is due to Grothendieck, although the original sources are not widely available.
متن کاملSome Combinatorial Principles
We extend some large cardinal axioms of Jensen to weakly inaccessible cardinals. Related problems regarding the saturatedness of certain filters are also studied.
متن کاملWeak Prediction Principles
We prove the consistency of the failure of the weak diamond Φλ at strongly inaccessible cardinals. On the other hand we show that the very weak diamond Ψλ is equivalent to the statement 2 <λ < 2 and hence holds at every strongly inaccessible cardinal. 2010 Mathematics Subject Classification. 03E05.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2019
ISSN: 2211-3576,2211-3568
DOI: 10.3233/com-180244